Global majority consensus by local majority polling on graphs of a given degree sequence
نویسندگان
چکیده
منابع مشابه
Consensus on the Initial Global Majority by Local Majority Polling for a Class of Sparse Graphs
We study the local majority protocol on simple graphs of a given degree sequence, for a certain class of degree sequences. We show that for almost all such graphs, subject to a sufficiently large bias, within time A logd logd n the local majority protocol achieves consensus on the initial global majority with probability 1− n−Ω((logn)ε), where ε > 0 is a constant. A is bounded by a universal co...
متن کاملMajority Consensus and the Local Majority Rule
we only show one further result that emphasizes our point that understanding LMP is fundamental to understanding any generalization of this process. A simple generalization of the local majority process would allow vertex v to have some resistivity towards color switch. Formally, for a nonnegative integer kv, we de ne a kv-local majority rule for vertex v: ct+1 v = ( ctv if jfw 2 Nv : ctw = ctv...
متن کاملProbabilistic consensus via polling and majority rules
In this paper, we consider lightweight decentralised algorithms for achieving consensus in distributed systems. Each member of a distributed group has a private value from a fixed set consisting of, say, two elements, and the goal is for all members to reach consensus on the majority value. We explore variants of the voter model applied to this problem. In the voter model, each node polls a ran...
متن کاملLocal Majority Dynamics on Preferential Attachment Graphs
Suppose in a graph G vertices can be either red or blue. Let k be odd. At each time step, each vertex v in G polls k random neighbours and takes the majority colour. If it doesn’t have k neighbours, it simply polls all of them, or all less one if the degree of v is even. We study this protocol on the preferential attachment model of Albert and Barabási [3], which gives rise to a degree distribu...
متن کاملThe Majority Strategy on Graphs
In a tree one can find the median set of a profile simply by starting at an arbitrary vertex and then moving to the majority of the profile. This strategy is formulated for arbitrary graphs. The graphs for which this strategy produces always the median set M(E), for each profile 7t, are precisely the median graphs. AMS C/ass$cication: Primary: 05C12,OSC75,05C99; secondary: 90B80
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2015
ISSN: 0166-218X
DOI: 10.1016/j.dam.2014.07.026